Countershading in Caterpillars
نویسندگان
چکیده
منابع مشابه
Can't tell the caterpillars from the trees: countershading enhances survival in a woodland.
Perception of the body's outline and three-dimensional shape arises from visual cues such as shading, contour, perspective and texture. When a uniformly coloured prey animal is illuminated from above by sunlight, a shadow may be cast on the body, generating a brightness contrast between the dorsal and ventral surfaces. For animals such as caterpillars, which live among flat leaves, a difference...
متن کاملContrast Restoration by Adaptive Countershading
We address the problem of communicating contrasts in images degraded with respect to their original due to processing with computer graphics algorithms. Such degradation can happen during the tone mapping of high dynamic range images, or while rendering scenes with low contrast shaders or with poor lighting. Inspired by a family of known perceptual illusions: Craik-O’Brien-Cornsweet, we enhance...
متن کاملUniversal caterpillars
For a class V of graphs, denote by a(@?) the least value of m so that for some graph II on m vertices, every GE Q occurs as a subgraph of U. In this note we obtain rather sharp bounds on u(q) when Q is the class of caterpillars on n vertices, i.e., tree with property that the vertices of degree exceeding one induce a path. Recently several of the authors have investigated graphs U(g) which are ...
متن کاملComputer vision, camouflage breaking and countershading.
Camouflage is frequently used in the animal kingdom in order to conceal oneself from visual detection or surveillance. Many camouflage techniques are based on masking the familiar contours and texture of the subject by superposition of multiple edges on top of it. This work presents an operator, D arg, for the detection of three-dimensional smooth convex (or, equivalently, concave) objects. It ...
متن کاملCaterpillars in Erdős-Hajnal
Let T be a tree such that all its vertices of degree more than two lie on one path; that is, T is a caterpillar subdivision. We prove that there exists > 0 such that for every graph G with |V (G)| ≥ 2 not containing T as an induced subgraph, either some vertex has at least |V (G)| neighbours, or there are two disjoint sets of vertices A,B, both of cardinality at least |V (G)|, where there is no...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Archives Néerlandaises de Zoologie
سال: 1956
ISSN: 0365-5164,1875-3019
DOI: 10.1163/036551656x00012